Some Results on Vandermonde Matrices with an Application to Time Series Analysis
نویسندگان
چکیده
In this paper we study Stein equations where the coefficient matrices are in companion form. Solutions to such equations are relatively easy to compute as soon as one knows how to invert a Vandermonde matrix (in the generic case where all eigenvalues have multiplicity one) or a confluent Vandermonde matrix (in the general case). As an application we present a way to compute the Fisher information matrix of an ARMA process. The computation is based on the fact that this matrix can be decomposed into blocks where each block satisfies a certain Stein equation.
منابع مشابه
Random Vandermonde Matrices-Part II: Applications
In this paper, we review some potential applications of random Vandermonde matrices in the field of signal processing and wireless communications. Using asymptotic results based on the theory of random Vandermonde matrices, we show through several application examples, namely deconvolution, wireless capacity analysis and sampling theory, the research potential of this theory. Quite surprisingly...
متن کاملSujet : Moments Method for Random Matrices with Applications to Wireless Communication
In this thesis, we focus on the analysis of the moments method, showing its importance in the application of random matrices to wireless communication. This study is conducted in the free probability framework. The concept of free convolution/deconvolution can be used to predict the spectrum of sums or products of random matrices which are asymptotically free. In this framework, we show that th...
متن کاملA Study of Vandermonde-like Matrix Systems With Emphasis on Preconditioning and Krylov Matrix Connection
The study focuses primarily on Vandermonde-like matrix systems. The idea is to express Vandermonde and Vandermonde-like matrix systems as the problems related to Krylov Matrices. The connection provides a different angle to view the Vandermondelike systems. Krylov subspace methods are strongly related to polynomial spaces, hence a nice connection can be established using LU factorization as pro...
متن کاملSpi Connuent Vandermonde Matrices Using Sylvester's Structures Connuent Vandermonde Matrices Using Sylvester's Structures
In this paper we rst show that a con uent Vandermonde matrix may be viewed as composed of some rows of a certain block Vandermonde matrix As a result we derive a Sylvester s structure for this class of matrices that ap pears as a natural generalization of the straightforward one known for usual Vandermonde matrices Then we present some applications as an illustration of the established structur...
متن کاملTR-2013003: Polynomial Evaluation and Interpolation: Fast and Stable Approximate Solution
Multipoint polynomial evaluation and interpolation are fundamental for modern algebraic and numerical computing. The known algorithms solve both problems over any field by using O(N log N) arithmetic operations for the input of size N , but the cost grows to quadratic for numerical solution. Our study results in numerically stable algorithms that use O(uN log N) arithmetic time for approximate ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 25 شماره
صفحات -
تاریخ انتشار 2003